A Tractable Subclass of Fuzzy Constraint Networks
نویسندگان
چکیده
The Fuzzy Constraint Networks model, a generalization of the Disjunctive Temporal Fuzzy Constraint Networks, is a framework that allows representing and reasoning with fuzzy qualitative and quantitative complex constraints. However, its general complexity is exponential, and we need to find tractable subclasses. In this paper we propose two algorithms to deal with a tractable subclass named Series-Parallel Fuzzy Constraint Networks.
منابع مشابه
SUBCLASS FUZZY-SVM CLASSIFIER AS AN EFFICIENT METHOD TO ENHANCE THE MASS DETECTION IN MAMMOGRAMS
This paper is concerned with the development of a novel classifier for automatic mass detection of mammograms, based on contourlet feature extraction in conjunction with statistical and fuzzy classifiers. In this method, mammograms are segmented into regions of interest (ROI) in order to extract features including geometrical and contourlet coefficients. The extracted features benefit from...
متن کاملReasoning with preferences over temporal, uncertain, and conditional statements
In this thesis we consider reasoning with preferences in a number of different AI problems. We start with a specific area as, temporal reasoning, for which there is specialized reasoning machinery. In particular, we consider quantitative temporal constraints and we add preferences in such a context. We discuss the complexity for solving temporal constraint satisfaction problems with preferences...
متن کاملA Revised Su cient Condition for Backtrack-Free Search
In this paper, we deene the notion of !-consistency and !-graph associated with general n-ary constraint satisfaction problems and present an alternative suu-cient condition for backtrack-free search; that is, if the hypergraph associated with a general CSP has a tree-structured !-graph, then enforcing !-consistency enables the CSP to be solved by search without backtracking. We then show that ...
متن کاملGlobal consistency in interval algebra networks : tractable
Global consistency is an important property in binary constraint satisfaction problems. It implies minimality in the sense that the edges contain all and only the labels that can participate in a global solution, which, for instance, is an important property in querying temporal knowledge bases. Another, computational, advantage of a globally consistent network is that nding a solution can be d...
متن کاملTractable Tree Convex Constraint Networks
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the values allowed for the other variable form a subtree of the constructed tree. It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consis...
متن کامل